358 Int. J. Bio-Inspired Computation, Vol. 3, No. 6, 2011 Wisdom of artificial crowds algorithm for solving NP-hard problems

Source URL: cecs.louisville.edu

Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied

Source URL: www.piercelab.caltech.edu

• Complexity classes
• Mathematical optimization
• NP-complete problems
• Structural complexity theory
• NP-hard
• NP-complete
• Dead-end elimination
• NP
• P
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions

Source URL: cognitiveharmony.net

• Complexity classes
• NP-hard
• NP-complete
• NP
• P versus NP problem
• P
• Reduction
• Decision problem
• Oracle machine
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Approximation schemes for NP-hard geometric optimization problems: A survey Sanjeev Arora∗ Princeton University NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the tra

Source URL: www.cs.duke.edu

CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID:

Source URL: web.engr.illinois.edu

• NP-complete problems
• Complexity classes
• NP-complete
• NP-hard
• NP
• Maximum cut
• Shortest path problem
• Travelling salesman problem
• P-complete
• Theoretical computer science
• Computational complexity theory
• Mathematics

CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID:

Source URL: web.engr.illinois.edu

• NP-complete problems
• Complexity classes
• NP-complete
• NP-hard
• NP
• Travelling salesman problem
• Vertex cover
• Maximum cut
• Shortest path problem
• Theoretical computer science
• Computational complexity theory
• Mathematics

Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology

Source URL: www.inf.kcl.ac.uk

• Critical thinking
• Arguments
• Logic
• Argumentation theory
• NP-complete
• Boolean satisfiability problem
• NP-hard
• Oracle machine
• Algorithm
• Theoretical computer science
• Applied mathematics
• Complexity classes

On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

Source URL: arxiv.org

• NP-complete problems
• Exponential time hypothesis
• Conjunctive normal form
• Boolean satisfiability problem
• Vertex cover
• Set cover problem
• Time complexity
• Graph coloring
• Independent set
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

Source URL: 2011.cccg.ca

• NP-complete problems
• Spanning tree
• Steiner tree problem
• NP-hard problems
• Minimum spanning tree
• Tree
• Vertex cover
• Rectilinear Steiner tree
• Connectivity
• Graph theory
• Theoretical computer science
• Mathematics

Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1

Source URL: www.mrfellows.net

• Complexity classes
• NP-complete problems
• Mathematical optimization
• Structural complexity theory
• Parameterized complexity
• P versus NP problem
• NP-complete
• NP-hard
• NP
• Theoretical computer science
• Computational complexity theory
• Applied mathematics